Invariants for Multidimensional Persistence
نویسنده
چکیده
The amount of data that our digital society collects is unprecedented. This represents a valuable opportunity to improve our quality of life by gaining insights about complex problems related to neuroscience, medicine and biology among others. Topological methods, in combination with classical statistical ones, have proven to be a precious resource in understanding and visualizing data. Multidimensional persistence is a method in topological data analysis which allows a multi-parameter analysis of a dataset through an algebraic object called multidimensional persistence module. Multidimensional persistence modules are complicated and contain a lot of information about the input data. This thesis deals with the problem of algorithmically describing multidimensional persistence modules and extracting information that can be used in applications. The information we extract, through invariants, should not only be efficiently computable and informative but also robust to noise. In Paper A we describe in an explicit and algorithmic way multidimensional persistence modules. This is achieved by studying the multifiltration of simplicial complexes defining multidimensional persistence modules. In particular we identify the special structure underlying the modules of n-chains of such multifiltration and exploit it to write multidimensional persistence modules as the homology of a chain complex of free modules. Both the free modules and the homogeneous matrices in such chain complex can be directly read off the multifiltration of simplicial complexes. Paper B deals with identifying stable invariants for multidimensional persistence. We introduce an algebraic notion of noise and use it to compare multidimensional persistence modules. Such definition allows not only to specify the properties of a dataset we want to study but also what should be neglected. By disregarding noise the, so called, persistent features are identified. We also propose a stable discrete invariant which collects properties of persistent features in a multidimensional persistence module.
منابع مشابه
ar X iv : 0 90 8 . 00 64 v 1 [ m at h . A T ] 1 A ug 2 00 9 MULTIDIMENSIONAL PERSISTENT HOMOLOGY IS STABLE
Multidimensional persistence studies topological features of shapes by analyzing the lower level sets of vector-valued functions. The rank invariant completely determines the multidimensional analogue of persistent homology groups. We prove that multidimensional rank invariants are stable with respect to function perturbations. More precisely, we construct a distance between rank invariants suc...
متن کاملMultidimensional persistence in biomolecular data
Persistent homology has emerged as a popular technique for the topological simplification of big data, including biomolecular data. Multidimensional persistence bears considerable promise to bridge the gap between geometry and topology. However, its practical and robust construction has been a challenge. We introduce two families of multidimensional persistence, namely pseudomultidimensional pe...
متن کاملNumeric Invariants from Multidimensional Persistence
We extend the results of Adcock, Carlsson, and Carlsson ([ACC13]) by constructing numeric invariants from the computation of a multidimensional persistence module as given by Carlsson, Singh, and Zomorodian in [CSZ10]. The use of topology to study point cloud data has been well established ([Car09], [Car14]). Given a finite metric space (e.g., a finite set in R n), one first constructs a filter...
متن کاملAlgebraic invariants for crystallographic defects in cellular automata
Let AZD be the Cantor space of Z-indexed configurations in a finite alphabet A, and let σ be the Z-action of shifts on AZD . A cellular automaton is a continuous, σ-commuting self-map Φ of AZD , and a Φ-invariant subshift is a closed, (Φ, σ)-invariant subset A ⊂ AZD . Suppose a ∈ AZD is A-admissible everywhere except for some small region we call a defect. It has been empirically observed that ...
متن کاملPersistence , Invariants , and Constraints
Recent work on reasoning about action has shown that there exist interesting connections among frame axioms, action invariants, state constraints and action speciications. In this paper, we address the problem of generating action invariants and generalizing action invariants into state constraints. We rst propose a persistence-based formalism of actions, and show that the generation of action ...
متن کامل